Active Learning Algorithms for Graphical Model Selection: Supplementary Material
نویسندگان
چکیده
Proof. To prove this theorem, we will use a simple argument that can be thought of as a proof by probabilistic induction. Towards this end, we will let Ek be the event that Algorithm 1 succeeds at iteration number k. Notice that k takes values in the set {1, 2, . . . , blog2(2p)c} since the algorithm terminates when the (doubling) counter satisfies ` = 2k−1 ≥ 2p. We can characterize the event Ek as follows:
منابع مشابه
Active Learning for Undirected Graphical Model Selection
This paper studies graphical model selection, i.e., the problem of estimating a graph of statistical relationships among a collection of random variables. Conventional graphical model selection algorithms are passive, i.e., they require all the measurements to have been collected before processing begins. We propose an active learning algorithm that uses junction tree representations to adapt f...
متن کاملActive Learning Algorithms for Graphical Model Selection
The problem of learning the structure of a high dimensional graphical model from data has received considerableattention in recent years. In many applications such as sensor networks and proteomics it is often expensive toobtain samples from all the variables involved simultaneously. For instance, this might involve the synchronization of alarge number of sensors or the tagging of a...
متن کاملSequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR
Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...
متن کاملSequential and Mixed Genetic Algorithm and Learning Automata (SGALA, MGALA) for Feature Selection in QSAR
Feature selection is of great importance in Quantitative Structure-Activity Relationship (QSAR) analysis. This problem has been solved using some meta-heuristic algorithms such as: GA, PSO, ACO, SA and so on. In this work two novel hybrid meta-heuristic algorithms i.e. Sequential GA and LA (SGALA) and Mixed GA and LA (MGALA), which are based on Genetic algorithm and learning automata for QSAR f...
متن کاملQUIC & DIRTY: A Quadratic Approximation Approach for Dirty Statistical Models
In this paper, we develop a family of algorithms for optimizing “superpositionstructured” or “dirty” statistical estimators for high-dimensional problems involving the minimization of the sum of a smooth loss function with a hybrid regularization. Most of the current approaches are first-order methods, including proximal gradient or Alternating Direction Method of Multipliers (ADMM). We propose...
متن کامل